PDE-based Parameter Reconstruction through Schur and Schwarz Decompositions

نویسندگان

  • Yuan He
  • David E. Keyes
چکیده

where Ω ⊂ R, with n = 2 for the results in section 4. Q and ∂Q are defined as Q ≡ Ω× (0, T ) and ∂Q ≡ ∂Ω× (0, T ), respectively. See [8] for details on system parameters. The objective of the parameter identification is to reconstruct the reactive coefficient α(x) in the first equation from boundary measurements of the electrical potential u. Our aim here is to present a numerical algorithm that can solve the reconstruction problem in large-scale (parallel) environments. The algorithm is of NewtonKrylov-Schur-Schwarz type; it combines Newton’s method for numerical optimization with Krylov subspace solvers for the resulting reduced Karush-Kuhn-Tucker (KKT) systems. Schwarz preconditioning is used to solve the partial differential equations that are involved in the inversion procedure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive Schwarz for the Schur Complement Method Additive Schwarz for the Schur Complement Method

Submitted to the proceedings of the ninth international conference on domain decomposition methods (Bergen-Norway-1996).

متن کامل

Field-Split Preconditioned Inexact Newton Algorithms

The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm is presented as a complement to additive Schwarz preconditioned inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partiti...

متن کامل

A new approximation of the Schur complement in preconditioners for PDE-constrained optimization

Saddle point systems arise widely in optimization problems with constraints. The utility of Schur complement approximation is now broadly appreciated in the context of solving such saddle point systems by iteration. In this short manuscript, we present a new Schur complement approximation for PDE constrained optimization, an important class of these problems. Block diagonal and block triangular...

متن کامل

A Comparative performance evaluation of SVD and Schur Decompositions for Image Watermarking

In this paper, the performance of SVD and Schur decomposition is evaluated and compared for image copyright protection applications. The watermark image is embedded in the cover image by using Quantization Index Modulus Modulation (QIMM) and Quantization Index Modulation (QIM). Watermark image is embedded in the D matrix of Schur decomposition and Singular Value Decomposition (SVD). Watermarkin...

متن کامل

A Krylov-Schur Algorithm for Matrix Products?

Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which employs reordered Schur decompositions to perform restarts and deflations in a numerically reliable manner. This paper describes a variant of the Krylov-Schur algorithm suitable for addressing eigenvalue problems associated with products of large and sparse matrices. It per...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008